A generalized global Arnoldi method for ill-posed matrix equations
نویسندگان
چکیده
منابع مشابه
A generalized global Arnoldi method for ill-posed matrix equations
This paper discusses the solution of large-scale linear discrete ill-posed problems with a noise-contaminated right-hand side. Tikhonov regularization is used to reduce the influence of the noise on the computed approximate solution. We consider problems in which the coefficient matrix is the sum of Kronecker products of matrices and present a generalized global Arnoldi method, that respects th...
متن کاملDynamical Systems Method for ill - posed equations with monotone operators ∗
Consider an operator equation (*) B(u) − f = 0 in a real Hilbert space. Let us call this equation ill-posed if the operator B (u) is not boundedly invertible, and well-posed otherwise. The DSM (dynamical systems method) for solving equation (*) consists of a construction of a Cauchy problem, which has the following properties: 1) it has a global solution for an arbitrary initial data, 2) this s...
متن کاملGlobal convergence for ill-posed equations with monotone operators: the dynamical systems method
Consider an operator equation F(u) = 0 in a real Hilbert space. Let us call this equation ill-posed if the operator F ′(u) is not boundedly invertible, and well-posed otherwise. If F is monotone C2 loc(H) operator, then we construct a Cauchy problem, which has the following properties: (1) it has a global solution for an arbitrary initial data, (2) this solution tends to a limit as time tends t...
متن کاملGeneralized Arnoldi-Tikhonov Method for Sparse Reconstruction
This paper introduces two new algorithms, belonging to the class of Arnoldi-Tikhonov regularization methods, which are particularly appropriate for sparse reconstruction. The main idea is to consider suitable adaptively-defined regularization matrices that allow the usual 2-norm regularization term to approximate a more general regularization term expressed in the p-norm, p ≥ 1. The regularizat...
متن کاملTheoretical results on the global GMRES method for solving generalized Sylvester matrix equations
The global generalized minimum residual (Gl-GMRES) method is examined for solving the generalized Sylvester matrix equation [sumlimits_{i = 1}^q {A_i } XB_i = C.] Some new theoretical results are elaborated for the proposed method by employing the Schur complement. These results can be exploited to establish new convergence properties of the Gl-GMRES method for solving genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2012
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.09.031